A Toolbox for Learning from Relational Data with Propositional and Multi-instance Learners
نویسندگان
چکیده
• uses SQL aggregate functions like SUM, MIN, MAX, AVG and computed standard deviation, quartile and range to capture relational information • for each value of a nominal column a new attribute is introduced, containing the number of occurrences • pairs of attributes (one is nominal) are used as GROUP BY conditions for additional aggregations • determines relations between tables based on name of primary key
منابع مشابه
Proper: A Toolbox for Learning from Relational Data with Propositional and Multi-Instance Learners
Databases predominantly employ the relational model for data storage. To use this data in a propositional learner, a propositionalization step has to take place. Similarly, the data has to be transformed to be amenable to a multi-instance learner. The Proper Toolbox contains an extended version of RELAGGS, the Multi-Instance Learning Kit MILK, and can also combine the multi-instance data with a...
متن کاملApplying propositional learning algorithms to multi-instance data
Multi-instance learning is commonly tackled using special-purpose algorithms. Development of these algorithms has started because early experiments with standard propositional learners have failed to produce satisfactory results on multi-instance data—more specifically, the Musk data. In this paper we present evidence that this is not necessarily the case. We introduce a simple wrapper for appl...
متن کاملA Framework for Learning Rules from Multiple Instance Data
This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is represented by a “bag” of fixed-length “feature vectors”. Such a representation, lying somewhere between propositional and first-order representation, offers a tradeoff between the two. NAIVE-RIPPERMI is one implementation of th...
متن کاملHow to Upgrade Propositional Learners to First Order Logic: A Case Study
We describe a methodology for upgrading existing attribute value learners towards rst order logic. This method has several advantages: one can proot from existing research on propositional learners (and inherit its eeciency and eeectiveness), relational learners (and inherit its expressiveness) and PAC-learning (and inherit its theoretical basis). Moreover there is a clear relationship between ...
متن کاملLearning Rules from Multiple Instance Data: Issues and Algorithms
In a multiple-instance representation, each learning example is represented by a “bag” of fixed-length “feature vectors”. Such a representation, lying somewhere between propositional and first-order representation, offers a tradeoff between the two. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. It describes NAIVE-RIPPERMI, an implementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004